Achieving Load Balancing through Program Slicing
نویسندگان
چکیده
منابع مشابه
Component Identification Through Program Slicing
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic code. An associated tool is also introduced. This piece of research is part of a broader project on program understanding and re-engineering of legacy code supported by formal methods.
متن کاملWeb Service Generation through Program Slicing
As the development of web service (WS), applications based on web services (WS), which are convenient and platform-independent, have become increasingly popular in recent years. However, how to identify, generate and compose services are still open issues. This paper proposes a method based on program slicing to realize the generation and composition of web services. This paper introduces the m...
متن کاملAnalyzing Slicing of Program through Cohesion Metric
This paper presents a new cohesion metric for a program which is used to analyze the slicing criterion. Based on the value of propose cohesion metric it is decided to perform slicing in a program or not. The propose cohesion metrics is also evaluated analytically against Weyuker’s Property and perform comparison with the existing cohesion metrics of Meyers et al. The results in this paper shows...
متن کاملUnderstanding Function Behaviors through Program Slicing
We present conditioned slicing as a general slicing framework for program comprehension. A conditioned slice consists of a subset of program statements which preserves the behavior of the original program with respect to a set of program executions. The set of initial states of the program that characterize these executions is speci ed in terms of a rst order logic formula on the input variable...
متن کاملAchieving Data-Aware Load Balancing through Distributed Queues and Key/Value Stores
Load balancing techniques (e.g. work stealing) are important to obtain the best performance for distributed task scheduling system. In work stealing, tasks are randomly migrated from heavy-loaded schedulers to idle ones. However, for data-intensive applications where tasks are dependent and task execution involves processing large amount of data, migrating tasks blindly would compromise the dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Research and Applications
سال: 2017
ISSN: 2248-9622,2248-9622
DOI: 10.9790/9622-0707011720